Extracting MUSes
نویسندگان
چکیده
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extracting MUSes can thus prove valuable because it circumscribes the sources of contradiction in an instance. In this paper, a new heuristic-based approach to approximate or compute MUSes is presented. It is shown that it often outperforms current competing ones.
منابع مشابه
Partial MUS Enumeration
Minimal explanations of infeasibility find a wide range of uses. In the Boolean domain, these are referred to as Minimal Unsatisfiable Subsets (MUSes). In some settings, one needs to enumerate MUSes of a Boolean formula. Most often the goal is to enumerate all MUSes. In cases where this is computationally infeasible, an alternative is to enumerate some MUSes. This paper develops a novel approac...
متن کاملFinding a Collection of MUSes Incrementally
Minimal Unsatisfiable Sets (MUSes) are useful in a number of applications. However, in general there are many different MUSes, and each application might have different preferences over these MUSes. Typical Muser systems produce a single MUS without much control over which MUS is generated. In this paper we describe an algorithm that can efficiently compute a collection of MUSes, thus presentin...
متن کاملOn Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the problem, strongly linking it to the maximal satisfiability problem. From this relationship, we have developed a novel technique for extracting all MUSes of a CNF formula, tightly integrating our implementation with a...
متن کاملThe MusES system: an environment for experimenting with knowledge representation techniques in tonal harmony
We report here on current works on the MusES environment, designed for experimenting with various objectoriented knowledge representation techniques in the field of tonal harmony. The first layer of MusES is a repository of consensus knowledge about tonal harmony, including an explicit representation of enharmonic spelling, as well as representation of intervals, scales and chords that support ...
متن کاملFormula Preprocessing in MUS Extraction
Efficient algorithms for extracting minimally unsatisfiable subformulas (MUSes) of Boolean formulas find a wide range of applications in the analysis of systems, e.g., hardware and software bounded model checking. In this paper we study the applicability of preprocessing techniques for Boolean satisfiability (SAT) in the context of MUS extraction. Preprocessing has proven to be extremely import...
متن کامل